When Structures Are Almost Surely Connected
نویسنده
چکیده
Let An denote the number of objects of some type of “size” n, and let Cn denote the number of these objects which are connected. It is often the case that there is a relation between a generating function of the Cn’s and a generating function of the An’s. Wright showed that if limn→∞Cn/An = 1, then the radius of convergence of these generating functions must be zero. In this paper we prove that if the radius of convergence of the generating functions is zero, then lim supn→∞Cn/An = 1, proving a conjecture of Compton; moreover, we show that lim infn→∞Cn/An can assume any value between 0 and 1.
منابع مشابه
A summary of The diameter of random sparse graphs
Massive graphs that arise in the studies of the Internet share many similar aspects with random graphs, although there are significant differences (e.g., there can be vertices with large degrees in a sparse massive graph). Nevertheless, many of the methods and ideas [1, 3] that are used in modeling and analyzing massive graphs have been frequently traced to the seminal papers of Erdős and Rényi...
متن کامل2 8 Se p 20 09 THICK POINTS OF THE GAUSSIAN FREE FIELD
U ∇f(x) · ∇g(x)dx. The set T (a;U) of a-thick points of F consists of those z ∈ U such that the average of F on a disk of radius r centered at z has growth √ a/π log 1 r as r → 0. We show that for each 0 ≤ a ≤ 2 the Hausdorff dimension of T (a;U) is almost surely 2− a, that ν2−a(T (a;U)) = ∞ when 0 < a ≤ 2 and ν2(T (0;U)) = ν2(U) almost surely, where να is the Hausdorff-α measure, and that T (a...
متن کاملAlmost Every Tree With m Edges Decomposes K 2m, 2m
We show that asymptotically almost surely a tree with m edges decomposes the complete bipartite graph K 2m,2m , a result connected to a conjecture of Graham and Häggkvist. The result also implies that asymptotically almost surely a tree with m edges decomposes the complete graph with O(m 2) edges. An ingredient of the proof consists in showing that the bipartition classes of the base tree of a ...
متن کاملPercolation and Phase Transition in SAT
Erdös and Rényi proved in 1960 that a drastic change occurs in a large random graph when the number of edges is half the number of nodes: a giant connected component surges. This was the origin of percolation theory, where statistic mechanics and mean field techniques are applied to study the behavior of graphs and other structures when we remove edges randomly. In the 90’s the study of random ...
متن کاملPercolative Properties of Brownian Interlacements and Its Vacant Set
Abstract In this article we investigate the percolative properties of Brownian interlacements, a model introduced by Alain-Sol Sznitman in [28], and show that: the interlacement set is “well-connected”, i.e., any two “sausages” in d-dimensional Brownian interlacements, d ≥ 3, can be connected via no more than d(d − 4)/2e intermediate sausages almost surely; while the vacant set undergoes a non-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 7 شماره
صفحات -
تاریخ انتشار 2000